A Comparative Analysis of Packet Reordering Metrics
نویسندگان
چکیده
* This research was supported in part by NSF ITR Grant No. 0121546, Ixia University Partners Program and Agilent Technologies. Nischal Piratla was with Colorado State University during this research; Email: {Nischal.Piratla, Anura.Jayasumana)@colostate.edu, [email protected] Abstract – Packet reordering is an inevitable phenomenon on the Internet. Reorder Density, Reorder Buffer-occupancy Density, Reorder Extent, and n-Reordering are metrics that have been proposed to measure packet reordering; they overcome to various degrees the deficiencies of percentage reordering in capturing the nature and extent of reordering. These metrics vary widely in areas such as evaluation complexity, measurement technique, usage, and in the definition used for packet reordering itself. An ideal metric for packet reordering will capture reordering accurately, provides insight into nature of reordering, and helps in analysis of reordering leading to mitigation of its adverse effects. Metrics for reordering are evaluated using a framework developed for their comparison and analysis. The framework consists of both essential and desirable attributes of reorder metrics that include capturing reordering, low sensitivity to lost and duplicate packets in reorder measurements, usefulness, simplicity, evaluation complexity, etc. Finally, the characterization of packet reordering using these metrics is discussed, using sets of measurements carried over the Internet.
منابع مشابه
Metrics for packet reordering - A comparative analysis
* This research was supported in part by NSF ITR Grant No. 0121546, Ixia University Partners Program and Agilent Technologies. [email protected], [email protected]. Abstract – Packet reordering is an inevitable phenomenon on the Internet. An ideal metric for packet reordering should capture reordering accurately, provide insight into nature of reordering, and help in evalu...
متن کاملRFC 5236 Improved Packet
This document presents two improved metrics for packet reordering, namely, Reorder Density (RD) and Reorder Buffer-occupancy Density (RBD). A threshold is used to clearly define when a packet is considered lost, to bound computational complexity at O(N), and to keep the memory requirement for evaluation independent of N, where N is the length of the packet sequence. RD is a comprehensive metric...
متن کاملRFC 4737 Packet
This memo defines metrics to evaluate whether a network has maintained packet order on a packet-by-packet basis. It provides motivations for the new metrics and discusses the measurement issues, including the context information required for all metrics. The memo first defines a reordered singleton, and then uses it as the basis for sample metrics to quantify the extent of reordering in several...
متن کاملMetrics for Degree of Reordering in Packet Sequences
1 This research was supported in part by the DARPA Next Generation Internet (NGI) program and the NSF Information Technology Research (ITR) grant no. 0121546. Abstract Out of order arrival of packets is an inevitable phenomenon on the Internet. Application performance can degrade to a great extent due to out-of-order arrival of packets. Metrics to characterize the degree of re-ordering will pro...
متن کاملAn Investigation of Scheduling and Packet Reordering Algorithms for Bandwidth Aggregation in Heterogeneous Wireless Networks
Heterogeneous Wireless Network (HWN) is the next generation wireless communication system’s platform where Internet services will be offered and delivered through multiple technologies like WiFi, WiMAX, GSM etc. There are some Internet applications that require high bandwidth and therefore, the bandwidth of an individual interface need to be aggregated to form a high speedy logical link. In thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005